In this paper, we propose novel channel-hoppingbased distributed rendezvousalgorithm based on grid-basedquorum techniques. The proposed algorithmincreases the probability of rendezvous (RDV) within a single cycle by allowingCR nodes to meet more often according to intersection property of quorumsystems (QSs). Our proposed algorithm is called Adaptive quorum-basedchannel-hopping distributed coordination scheme for cognitive radio networks.The main idea of our algorithm is to dynamically adjust the selected QS by CRusers according to the varying traffic loads in the CRN. The proposed algorithmdecreases the average time to rendezvous (TTR) and increase the probability ofRDV. We evaluate the performance of our algorithm through simulations. Theperformance of our algorithm is compared with two different schemes. Theresults show that our algorithm can reduce TTR, increase the RDV, and decreasethe energy consumption per successful RDV.
展开▼